package com.wc.blue_bridge_history.JavaLast.G_基德的密码锁;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;

/**
 * @Author congge
 * @Date 2024/4/7 19:25
 * @description https://www.lanqiao.cn/paper/3998/problem/4150/
 */
public class Main {
    static FastReader sc = new FastReader();
    static PrintWriter out = new PrintWriter(System.out);
    static int P = 998244353;
    static int N = 1010, M = 5010, K = 5010;
    static long[][] f1 = new long[2][M];
    static long[][] f2 = new long[2][M];
    static int n, k, m;

    public static void main(String[] args) {
        n = sc.nextInt();
        m = sc.nextInt();
        k = sc.nextInt();
        for (int i = 1; i <= m; i++) {
            f1[1][i] = 1;
            f2[1][i] = 1;
        }
        // 前缀和
        for (int i = 1, j = m; i <= m; i++, j--) {
            f1[1][i] += f1[1][i - 1];
            f2[1][j] += f2[1][j + 1];
        }

        for (int i = 2; i <= n; i++) {
            for (int j = 1; j <= m; j++) {
                if (k == 0) {
                    f1[i & 1][j] = f1[i & 1 ^ 1][Math.max(0, j - k)];
                    f2[i & 1][j] = f2[i & 1 ^ 1][Math.min(m + 1, j + k)];
                } else
                    f2[i & 1][j] = f1[i & 1][j] = (f1[i & 1 ^ 1][Math.max(0, j - k)] + f2[i & 1 ^ 1][Math.min(j + k, m + 1)]) % P;
            }
            for (int j = 1, k = m; j <= m; j++, k--) {
                f1[i & 1][j] = (f1[i & 1][j] + f1[i & 1][j - 1]) % P;
                f2[i & 1][k] = (f2[i & 1][k] + f2[i & 1][k + 1]) % P;
            }
        }

        out.println(f1[n & 1][m]);
        out.flush();
    }
}

class FastReader {
    StringTokenizer st;
    BufferedReader br;

    FastReader() {
        br = new BufferedReader(new InputStreamReader(System.in));
    }

    String next() {
        while (st == null || !st.hasMoreElements()) {
            try {
                st = new StringTokenizer(br.readLine());
            } catch (IOException e) {
                e.printStackTrace();
            }
        }
        return st.nextToken();
    }

    int nextInt() {
        return Integer.parseInt(next());
    }

    String nextLine() {
        String s = "";
        try {
            s = br.readLine();
        } catch (IOException e) {
            e.printStackTrace();
        }
        return s;
    }

    long nextLong() {
        return Long.parseLong(next());
    }

    double nextDouble() {
        return Double.parseDouble(next());
    }

    // 是否由下一个
    boolean hasNext() {
        while (st == null || !st.hasMoreTokens()) {
            try {
                String line = br.readLine();
                if (line == null)
                    return false;
                st = new StringTokenizer(line);
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        }
        return true;
    }
}
